Polymorphic Subtyping for Effect Analysis: The Integration
نویسندگان
چکیده
منابع مشابه
Polymorphic Subtyping for Effect Analysis: The Algorithm
We study an annotated type and effect system that integrates let-polymorphism, effects, and subtyping into an annotated type and effect system for a fragment of Concurrent ML. First we define a type inference algorithm and then construct procedures for constraint normalisation and simplification. Next these algorithms are proved syntactically sound with respect to the annotated type and effect ...
متن کاملPolymorphic Subtyping for Effect Analysis: The Static Semantics
The integration of polymorphism (in the style of the ML let-construct), subtyping, and effects (modelling assignment or communication) into one common type system has proved remarkably difficult. One line of research has succeeded in integrating polymorphism and subtyping; adding effects in a straightforward way results in a semantically unsound system. Another line of research has succeeded in...
متن کاملPolymorphic Subtyping for Effect Analysis: The Dynamic Semantics
We study an annotated type and effect system that integrates let-polymorphism, effects, and subtyping into an annotated type and effect system for a fragment of Concurrent ML. First a small-step operational semantics is defined and next the annotated type and effect system is proved semantically sound. This provides insights into the rule for generalisation in the annotated type and effect system.
متن کاملPolymorphic subtyping in O'Haskell
O’Haskell is a programming language derived from Haskell by the addition of concurrent reactive objects and subtyping. Because Haskell already encompasses an advanced type system with polymorphism and overloading, the type system of O’Haskell is much richer than what is the norm in almost any widespread object-oriented or functional language. Yet, there is strong evidence that O’Haskell is not ...
متن کاملPolymorphic Subtyping Without Distributivity
The subtyping relation in the polymorphic second-order-calculus was introduced by John C. Mitchell in 1988. It is known that this relation is undecidable, but all known proofs of this fact strongly depend on the distributivity axiom. Nevertheless it has been conjectured that this axiom does not innuence the undecidability. The present paper shows undecidability of subtyping when we remove distr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 1996
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v25i501.7030